Sweeping Arrangements of Cubic Segments Exactly and Efficiently
نویسندگان
چکیده
A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible input segments comprises conic arcs and cubic splines as special cases of particular practical importance.
منابع مشابه
Study on Commercial Membranes and Sweeping Gas Membrane Distillation for Concentrating of Glucose Syrup
In this work, sweeping gas membrane distillation (SGMD) process was used for concentrating of glucose syrup. The main questions in this work include: is SGMD process practical for concentrating of glucose solution prior the fermentation step in bioethanol process?. and are the commercially available hydrophobic membranes sufficient enough to develop the SGMD process in pilot scale for this issu...
متن کاملMinimum cell connection and separation in line segment arrangements
We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement: (i) compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; (ii) compu...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملFixed-point Fast Sweeping Weno Methods for Steady State Solution of Scalar Hyperbolic Conservation Laws
Fast sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilize the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamil...
متن کاملSweeps, arrangements and signotopes
Sweeping is an important algorithmic tool in geometry. In the rst part of this paper we deene sweeps of arrangements and use thèSweeping Lemma' to show that Euclidean arrangements of pseudolines can be represented by wiring diagrams and zonotopal tilings. In the second part we introduce a new representation for Euclidean arrangements of pseudolines. This representation records anòrientation' fo...
متن کامل